A Note on the Discriminator
نویسنده
چکیده
For f(X) ∈ Z[X], let Df (n) be the least positive integer k for which f(1), . . . , f(n) are distinct modulo k. Several results have been proven about the function Df in recent years, culminating in Moree’s characterization of Df (n) whenever f lies in a certain (large) subset of Z[X] and n is sufficiently large. We give several improvements of Moree’s result, as well as further results on the function Df .
منابع مشابه
A Class of Exponential Sequences with Shift-Invariant Discriminators
The discriminator of an integer sequence s = (s(i))i≥0, introduced by Arnold, Benkoski, and McCabe in 1985, is the function Ds(n) that sends n to the least integer m such that the numbers s(0), s(1), . . . , s(n−1) are pairwise incongruent modulo m. In this note we present a class of exponential sequences that have the special property that their discriminators are shift-invariant, i.e., that t...
متن کاملA 76 INTEGERS 16 ( 2016 ) DISCRIMINATORS AND k - REGULAR SEQUENCES
The discriminator of an integer sequence s = (s(i))i 0, introduced by Arnold, Benkoski, and McCabe in 1985, is the map Ds(n) that sends n 1 to the least positive integer m such that the n numbers s(0), s(1), . . . , s(n 1) are pairwise incongruent modulo m. In this note we consider the discriminators of a certain class of sequences, the k-regular sequences. We compute the discriminators of two ...
متن کاملDiscriminators and k-Regular Sequences
The discriminator of an integer sequence s = (s(i))i≥0, introduced by Arnold, Benkoski, and McCabe in 1985, is the map Ds(n) that sends n ≥ 1 to the least positive integer m such that the n numbers s(0), s(1), . . . , s(n − 1) are pairwise incongruent modulo m. In this note we consider the discriminators of a certain class of sequences, the k-regular sequences. We compute the discriminators of ...
متن کاملLinking Generative Adversarial Learning and Binary Classification
In this note, we point out a basic link between generative adversarial (GA) training and binary classification – any powerful discriminator essentially computes an (f -)divergence between real and generated samples. The result, repeatedly re-derived in decision theory, has implications for GA Networks (GANs), providing an alternative perspective on training f -GANs by designing the discriminato...
متن کاملDiscriminator Varieties of Boolean Algebras with Residuated Operators
The theory of discriminator algebras and varieties has been investigated extensively, and provides us with a wealth of information and techniques applicable to specific examples of such algebras and varieties. Here we give several such examples for Boolean algebras with a residuated binary operator, abbreviated as r-algebras. More specifically, we show that all finite r-algebras, all integral r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007